A parallelizable and fast algorithm for verylarge generalized eigenproblemsHenk
نویسنده
چکیده
We discuss a novel iterative approach for the computation of a number of eigenvalues and eigenvectors of the generalized eigenprob-lem Ax = Bx. Our method is based on a combination of the Jacobi-Davidson method and the QZ-method. For that reason we refer to the method as JDQZ. The eeectiveness of the method is illustrated by a numerical example.
منابع مشابه
GENERALIZED FLEXIBILITY-BASED MODEL UPDATING APPROACH VIA DEMOCRATIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR STRUCTURAL DAMAGE PROGNOSIS
This paper presents a new model updating approach for structural damage localization and quantification. Based on the Modal Assurance Criterion (MAC), a new damage-sensitive cost function is introduced by employing the main diagonal and anti-diagonal members of the calculated Generalized Flexibility Matrix (GFM) for the monitored structure and its analytical model. Then, ...
متن کاملA Parallelizable and Fast Algorithm for Very Large Generalized Eigenproblems
We discuss a novel iterative approach for the computation of a number of eigenvalues and eigenvectors of the generalized eigenproblem A x = ABx . Our method is based on a combination of the JacobiDavidson method and the QZ-method. For that reason we refer to the method as JDQZ. The effectiveness of the method is illustrated by a numerical example.
متن کاملOptimal DC Fast Charging Placing And Sizing In Iran Capital (Tehran)
DC fast charging (DCFC) and optimal placing of them is a fundamental factor for the popularization of electric vehicles (EVs). This paper proposes an approach to optimize place and size of charging stations based on genetic algorithm (GA). Target of this method is minimizing cost of conversion of gas stations to charging stations. Another considered issue is minimizing EVs losses to find neares...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007